This file was created with JabRef 2.2.
Encoding: GBK

@INPROCEEDINGS{Daw89,
  author = {Robin W. Dawes},
  title = {Minimum Odd Neighbourhood Covers for Trees},
  booktitle = {Great Lakes Computer Science Conference},
  year = {1989},
  editor = {Naveed A. Sherwani and Elise de Doncker and John A. Kapenga},
  volume = {507},
  series = {Lecture Notes in Computer Science},
  pages = {161--169},
  publisher = {Springer},
  bibdate = {2002-03-01},
  bibsource = {DBLP, http://dblp.uni-trier.de/db/conf/glakes/glakes1989.html#Dawes89},
  crossref = {conf/glakes/1989},
  isbn = {3-540-97628-0}
}

@ARTICLE{AmS96,
  author = {A. T. Amin and Peter J. Slater},
  title = {All parity realizable trees},
  journal = {J. Combin. Math. Combin. Comput},
  year = {1996},
  volume = {20},
  pages = {53--63}
}

@ARTICLE{AmS92,
  author = {A. T. Amin and Peter J. Slater},
  title = {Neighborhood domination with parity restrictions in graphs},
  journal = {Congressus Numerantium},
  year = {1992},
  volume = {91},
  pages = {19--30}
}

@ARTICLE{ArL96,
  author = {Arora, S. and Lund, C.},
  title = {{Hardness of approximations}},
  journal = {Approximation algorithms for NP-hard problems},
  year = {1996},
  pages = {399--446},
  publisher = {PWS Publishing Co. Boston, MA, USA}
}

@MISC{Ary02,
  author = {Sunil Arya and Siu-Wing Cheng and Rudolf Fleischer and Mordecai Golin
	and Torleiv Klove and Stefan Langermann and Leung Yiu Cho and Hyeon-Suk
	Na and Poon Sheung Hung and Gerhard Trippen and Tsui Ho Man and Antoine
	Vignerson and Joseph Zhou Zhen},
  title = {Fiver},
  year = {2002}
}

@ARTICLE{BaR96,
  author = {Rana Barua and S. Ramakrishnan},
  title = {{$\sigma$}-game, {$\sigma^+$}-game and two-dimensional additive cellular
	automata},
  journal = {Theoretical Computer Science},
  year = {1996},
  volume = {154},
  pages = {349--366},
  number = {2},
  month = {5~} # feb,
  note = {Mathematical Games}
}

@ARTICLE{BMT78,
  author = {Berlekamp and McEliece and van Tilborg},
  title = {On the Inherent Intractability of Certain Coding Problems},
  journal = {IEEETIT: IEEE Transactions on Information Theory},
  year = {1978},
  volume = {24}
}

@ARTICLE{Car96,
  author = {Yair Caro},
  title = {Simple proffs to three parity theorems},
  journal = {Ars Comb},
  year = {1996},
  volume = {42},
  bibdate = {2004-01-20},
  bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/arscom/arscom42.html#Caro96}
}

@ARTICLE{CLW04,
  author = {William Y. C. Chen and Xueliang Li and Chao Wang and Xiaoyan Zhang},
  title = {The Minimum All-Ones Problem for Trees},
  journal = {SIAM Journal on Computing},
  year = {2004},
  volume = {33},
  pages = {379--392},
  number = {2},
  month = apr,
  acknowledgement = {Nelson H. F. Beebe, University of Utah, Department of Mathematics,
	110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA,
	Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|,
	\path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL:
	\path|http://www.math.utah.edu/~beebe/|},
  bibdate = {Sat Apr 16 10:19:19 MDT 2005},
  bibsource = {http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/33/2},
  coden = {SMJCAT},
  doi = {http://dx.doi.org/10.1137/S0097539703421620},
  doi-url = {http://dx.doi.org/10.1137/S0097539703421620},
  issn = {0097-5397 (print), 1095-7111 (electronic)},
  url = {http://epubs.siam.org/sam-bin/dbq/article/42162}
}

@ARTICLE{CFF99,
  author = {Margaret M. Conlon and Maria Falidas and Mary Jane Forde and John
	W. Kennedy and Susan Mcllwaine and Joseph Stern},
  title = {Inversion Numbers of Graphs},
  journal = {Graph Theory Notes of New York},
  year = {1999},
  volume = {37},
  pages = {42--48}
}

@ARTICLE{CHK99,
  author = {Robert Cowen and Stephen H. Hechier and John W. Kennedy and Alex
	Ryba},
  title = {Inversion and Neighborhood Inversion in Graphs},
  journal = {Graph Theory Notes of New York},
  year = {1999},
  volume = {37},
  pages = {37--41}
}

@INPROCEEDINGS{DoW01,
  author = {Yevgeniy Dodis and Peter Winkler},
  title = {Universal Configurations in {Light-Flipping} Games},
  booktitle = {Proceedings of the Twelfth Annual {ACM}-{SIAM} Symposium on Discrete
	Algorithms ({SODA}-01)},
  year = {2001},
  pages = {926--927},
  address = {New York},
  month = jan # { ~7--9},
  publisher = {ACM Press}
}

@ARTICLE{EES04,
  author = {Henrik Eriksson and Kimmo Eriksson and Jonas Sjostrand},
  title = {Note on the lamp lighting problem},
  journal = {Advances of Applied Mathematics},
  year = {2004},
  volume = {27},
  pages = {357--366},
  month = nov # {~09},
  bibsource = {OAI-PMH server at arXiv.org},
  identifier = {Advances of Applied Mathematics 27, 2001, pages 357-366},
  oai = {oai:arXiv.org:math/0411201},
  subject = {Combinatorics; 05C50; 05B45, 52C20, 11C20, 15A36, 68Q80},
  url = {http://arxiv.org/abs/math/0411201}
}

@MISC{Gol00,
  author = {John Goldwasser},
  title = {Maximization Versions of {"}Lights Out{"} Games in Grids and Graphs},
  month = aug # {~27},
  year = {2000},
  annote = {John Goldwasser (Dept . of Mathematics; Dept . of Computer Science;
	West Virginia University; Morgantown , WV 26506);},
  bibsource = {OAI-PMH server at cs1.ist.psu.edu},
  citeseer-references = {oai:CiteSeerPSU:252671; oai:CiteSeerPSU:465854; oai:CiteSeerPSU:483105},
  language = {en},
  oai = {oai:CiteSeerPSU:479511},
  rights = {unrestricted},
  url = {http://citeseer.ist.psu.edu/479511.html; http://www.unf.edu/~wkloster/fibonacci/congnum.ps}
}

@MISC{GoK97,
  author = {Goldwasser, J. and Klostermeyer, W. and Trapp, G.},
  title = {{Characterizing Switch-Setting Problems}},
  year = {1997},
  journal = {Linear and Multilinear Algebra},
  number = {1-3},
  pages = {121--136},
  volume = {43}
}

@MISC{GKZ95,
  author = {John Goldwasser and W. F. Klostermeyer and C. Q. Zhang},
  title = {Setting Switches in a Grid},
  month = aug # {~27},
  year = {1995},
  annote = {John Goldwasser (West Virginia University; Morgantown , WV 26506);
	W. F. Klostermeyer (West Virginia University; Morgantown , WV 26506);
	C. Q. Zhang (West Virginia University; Morgantown , WV 26506);},
  bibsource = {OAI-PMH server at cs1.ist.psu.edu},
  language = {en},
  oai = {oai:CiteSeerPSU:465854},
  rights = {unrestricted},
  url = {http://citeseer.ist.psu.edu/465854.html; http://www.unf.edu/~wkloster/fibonacci/switch.ps}
}

@ARTICLE{GKW02,
  author = {John L. Goldwasser and William Klostermeyer and Henry Ware},
  title = {Fibonacci Polynomials and Parity Domination in Grid Graphs},
  journal = {Graphs and Combinatorics},
  year = {2002},
  volume = {18},
  pages = {271--283},
  number = {2},
  bibdate = {2006-11-24},
  bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/gc/gc18.html#GoldwasserKW02},
  url = {http://dx.doi.org/10.1007/s003730200020}
}

@MISC{Klo01,
  author = {William Klostermeyer},
  title = {Lights Out!: {A} Survey of Parity Domination in Grid Graphs},
  month = dec # {~11},
  year = {2001},
  annote = {William Klostermeyer (University of North Florida; Jacksonville ,
	FL 32224);},
  bibsource = {OAI-PMH server at cs1.ist.psu.edu},
  citeseer-references = {oai:CiteSeerPSU:465854; oai:CiteSeerPSU:483105; oai:CiteSeerPSU:490088},
  description = {A non-empty set of vertices is called an even dominating set if each
	vertex in the graph is adjacent to an even number of vertices in
	the set (adjacency is reexive). An odd dominating set is dened analogously.},
  language = {en},
  oai = {oai:CiteSeerPSU:498805},
  rights = {unrestricted},
  url = {http://citeseer.ist.psu.edu/498805.html; http://www.unf.edu/~wkloster/termpaper.ps}
}

@ARTICLE{McL84,
  author = {Aileen M. McLoughlin},
  title = {The complexity of computing the covering radius of a code},
  journal = {IEEE Transactions on Information Theory},
  year = {1984},
  volume = {30},
  pages = {800--804},
  number = {6},
  bibdate = {2005-03-09},
  bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/tit/tit30.html#McLoughlin84}
}

@ARTICLE{Sut00,
  author = {Klaus Sutner},
  title = {$\sigma$-Automata and {Chebyshev}-polynomials},
  journal = {Theoretical Computer Science},
  year = {2000},
  volume = {230},
  pages = {49--73},
  number = {1--2},
  month = jan,
  acknowledgement = {Nelson H. F. Beebe, University of Utah, Department of Mathematics,
	110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA,
	Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|,
	\path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL:
	\path|http://www.math.utah.edu/~beebe/|},
  bibdate = {Tue Oct 31 11:37:53 MST 2000},
  bibsource = {http://www.elsevier.com/locate/issn/03043975},
  coden = {TCSCDI},
  day = {6},
  issn = {0304-3975},
  url = {http://www.elsevier.nl/gej-ng/10/41/16/164/21/23/abstract.html; http://www.elsevier.nl/gej-ng/10/41/16/164/21/23/article.pdf}
}

@ARTICLE{Sut90,
  author = {Klaus Sutner},
  title = {{The $\sigma$-Game and Cellular Automata}},
  journal = {The American Mathematical Monthly},
  year = {1990},
  volume = {97},
  pages = {24--34},
  number = {1},
  publisher = {JSTOR}
}

@ARTICLE{Sut89,
  author = {Klaus Sutner},
  title = {Linear Cellular Automata and the Garden-of-Eden},
  journal = {The mathematical intelligencer.},
  year = {1989},
  volume = {11},
  pages = {49},
  number = {2}
}

@ARTICLE{Sut88,
  author = {Klaus Sutner},
  title = {Additive Automata on Graphs},
  journal = {Complex Systems},
  year = {1988},
  volume = {2},
  pages = {649--661},
  number = {6},
  month = dec,
  key = {Sutner},
  location = {CMU E\&{}S Library}
}

@ARTICLE{Val78,
  author = {Valdes, J.},
  title = {{Parsing Flowcharts and Series-Parallel Graphs}},
  year = {1978},
  publisher = {Computer Science Department, Stanford University}
}

@ARTICLE{VTL82,
  author = {Valdes, J. and Tarjan, R.E. and Lawler, E.L.},
  title = {{The Recognition of Series Parallel Digraphs}},
  journal = {SIAM Journal on Computing},
  year = {1982},
  volume = {11},
  pages = {298},
  publisher = {SIAM}
}

@ARTICLE{Var97,
  author = {Alexander Vardy},
  title = {The intractability of computing the minimum distance of a code},
  journal = {IEEE Transactions on Information Theory},
  year = {1997},
  volume = {43},
  pages = {1757--1766},
  number = {6},
  bibdate = {2004-09-24},
  bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/tit/tit43.html#Vardy97}
}

@MISC{WaW07,
  author = {Xinmao Wang and Yaokun Wu},
  title = {$\sigma$-game on trees: covering radius and tree order},
  year = {2007}
}

